منابع مشابه
the search for the self in becketts theatre: waiting for godot and endgame
this thesis is based upon the works of samuel beckett. one of the greatest writers of contemporary literature. here, i have tried to focus on one of the main themes in becketts works: the search for the real "me" or the real self, which is not only a problem to be solved for beckett man but also for each of us. i have tried to show becketts techniques in approaching this unattainable goal, base...
15 صفحه اولthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولShelling the coset poset
It is shown that the coset lattice of a finite group has shellable order complex if and only if the group is complemented. Furthermore, the coset lattice is shown to have a Cohen–Macaulay order complex in exactly the same conditions. The group theoretical tools used are relatively elementary, and avoid the classification of finite simple groups and of minimal finite simple groups. © 2006 Elsevi...
متن کاملThe Spider Poset is
Let Q(k; l) be a poset whose Hasse diagram is a regular spider with k +1 legs having the same length l (cf. Fig. 1). We show that for any n 1 the n th cartesian power of the spider poset Q(k; l) is a Macaulay poset for any k 0 and l 1. In combination with our recent results 2] this provides a complete characterization of all Macaulay posets which are cartesian powers of upper semilattices, whos...
متن کاملThe partition method for poset-free families
Given a finite poset P , let La(n, P ) denote the largest size of a family of subsets of an n-set that does not contain P as a (weak) subposet. We employ a combinatorial method, using partitions of the collection of all full chains of subsets of the nset, to give simpler new proofs of the known asymptotic behavior of La(n, P ), as n → ∞, when P is the r-fork Vr, the four-element N poset N , and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematika
سال: 2020
ISSN: 0025-5793,2041-7942
DOI: 10.1112/mtk.12044